625 Search Results

Target of rapamycin (TOR) and sucrose non-fermenting 1–related protein kinase 1 (SnRK1) are conserved regulators of plant growth and metabolism and are often portrayed as functionally antagonistic under nutrient limitation. However, how this relationship operates across different nutrient contexts remains poorly defined. Here, we generated an Arabidopsis dual-reporter line that enables simultaneous monitoring of TOR and SnRK1 activities and profiled their dynamics under carbon and nitrogen perturbations. We found that TOR and SnRK1 activities\r\noverall exhibit a negative relationship during the transition from carbon starvation to carbon abundance; however, their temporal dynamics during that transition do not support a strictly inversemore » correlation. Under dark conditions, TOR activity is gradually repressed, while SnRK1 is initially repressed in the early hours and subsequently activated during extended darkness. During nitrogen starvation, TOR activity is progressively repressed, whereas SnRK1 is activated during early hours and then becomes repressed. In vitro, recombinant SnRK1a1 directly\r\ninhibits the activity of immunoprecipitated TOR (IP-TOR), whereas IP-TOR does not directly affect SnRK1a1 activity. Together, these results support a nutrient dependent model in which TOR and SnRK1 are coordinated primarily by cellular metabolic status.\r\n« less

While the Experimental Physics and Industrial Control System (EPICS) is widely used at large laboratories for slow controls and instrumentation, the deployment of a full EPICS installation can be difficult, with a steep learning curve to new users. Taking advantage of the pythonSoftIOC module, we developed an EPICS slow controls implementation for Jefferson Lab's Hall B cryotarget written entirely in Python and based on software IOCs that communicate with instruments over Ethernet. Here, this system ran successfully, interfacing with Jefferson Lab's full EPICS network, and we offer it as an example of the capabilities of pythonSoftIOC to build lightweight, yetmore » robust and flexible instrumentation platforms that would be easily adapted for use at a small-scale laboratory. University groups can use these examples to build complete slow controls systems, from device communication to data archiving and display, using open-source, mature EPICS tools and student-friendly Python as an alternative to expensive and proprietary systems such as LabVIEW.« less

This paper presents a highly-efficient finite element scheme for the time relaxation model (TRM). The efficiency is achieved through the second-order BDF2 time-stepping scheme with linear extrapolation (BDF2LE). The accuracy of the scheme is also greatly enhanced through the use of the divergence-free Scott-Vogeulis finite elements, and van Cittert approximate deconvolution. A complete finite element analysis is provided, which includes rigorous proofs for the stability, well-possessedness, and convergence of both velocity and pressure solutions. Furthermore, we also demonstrate that the inclusion of the linear time relaxation term preserves the long-time stability of the unregularized BDF2LE scheme. Finally, numerical experiments aremore » presented that demonstrate the added stability and accuracy that time relaxation can provide.« less

Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa.TrkX, a machine learning-based algorithm.more » The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era.« less

We present and analyze two stabilized finite element methods for solving numerically the Poisson–Nernst–Planck equations. The stabilization we consider is carried out by using a shock detector and a discrete graph Laplacian operator for the ion equations, whereas the discrete equation for the electric potential need not be stabilized. Discrete solutions stemmed from the first algorithm preserve both maximum and minimum discrete principles. For the second algorithm, its discrete solutions are conceived so that they hold discrete principles and obey an entropy law provided that an acuteness condition is imposed for meshes. Remarkably the latter is found to be unconditionallymore » stable. We validate our methodology through transient numerical experiments that show convergence toward steady-state solutions.« less

Nonintrusive projection-based reduced order models (ROMs) are essential for dynamics prediction in multi-query applications where underlying governing equations are known but the access to the source of the underlying full order model (FOM) is unavailable; that is, FOM is a glass-box. This article proposes a learn-then-project approach for nonintrusive model reduction. In the first step of this approach, high-dimensional stable sparse learned differential operators (S-LDOs) are determined using the generated data. In the second step, the ordinary differential equations, comprising these S-LDOs, are used with suitable dimensionality reduction and low-dimensional subspace projection methods to provide equations for the evolution ofmore » reduced states. This approach allows easy integration into the existing intrusive ROM framework to enable nonintrusive model reduction while allowing the use of Petrov–Galerkin projections. The applicability of the proposed approach is demonstrated for Galerkin and LSPG projection-based ROMs through four numerical experiments: 1-D scalar advection, 1-D Burgers, 2-D scalar advection and 1-D scalar advection–diffusion–reaction equations. In conclusion, the results indicate that the proposed nonintrusive ROM strategy provides accurate and stable dynamics prediction.« less

Here, we propose a predictor-corrector adaptive method for the study of hyperbolic partial differential equations (PDEs) under uncertainty. Constructed around the framework of stochastic finite volume (SFV) methods, our approach circumvents sampling schemes or simulation ensembles while also preserving fundamental properties, in particular hyperbolicity of the resulting systems and conservation of the discrete solutions. Furthermore, we augment the existing SFV theory with a priori convergence results for statistical quantities, in particular push-forward densities, which we demonstrate through numerical experiments. By linking refinement indicators to regions of the physical and stochastic spaces, we drive anisotropic refinements of the discretizations, introducing newmore » degrees of freedom where deemed profitable. To illustrate our proposed method, we consider a series of numerical examples for nonlinear hyperbolic PDEs based on Burgers’ and Euler’s equations.« less

Recently, a new class of nonlinearly partitioned Runge–Kutta (NPRK) methods was proposed for nonlinearly partitioned systems of autonomous ordinary differential equations y' = F(y, y). The target class of problems are those in which different scales, stiffnesses, or physics are coupled in a nonlinear way, wherein the desired partition cannot be written in a classical additive or component-wise fashion. Here we use a rooted-tree analysis to derive full-order conditions for NPRKM methods, where M denotes the number of nonlinear partitions. Due to the nonlinear coupling and thereby the mixed product differentials, it turns out that the standard node-colored rooted treemore » analysis used in analyzing ODE integrators does not naturally apply. Instead we develop a new edge-colored rooted-tree framework to address the nonlinear coupling. The resulting order conditions are enumerated, are provided directly for up to fourth order with M = 2 and third order with M = 3, and are related to existing order conditions of additive and partitioned RK methods. We conclude with an example that shows how the nonlinear order conditions can be used to obtain an embedded estimate of the state-dependent nonlinear coupling strength in a dynamical system.« less

The ATLAS experiment has developed extensive software and distributed computing systems for Run 3 of the LHC. These systems are described in detail, including software infrastructure and workflows, distributed data and workload management, database infrastructure, and validation. The use of these systems to prepare the data for physics analysis and assess its quality are described, along with the software tools used for data analysis itself. An outlook for the development of these projects towards Run 4 is also provided.

We consider the issue of strict, fully discrete local energy conservation for a whole class of fully implicit local-charge- and global-energy-conserving particle-in-cell (PIC) algorithms. Earlier studies demonstrated these algorithms feature strict global energy conservation. However, whether a local energy conservation theorem exists (in which the local energy update is governed by a flux balance equation at every mesh cell) for these schemes is unclear. In this study, we show that a local energy conservation theorem indeed exists. We begin our analysis with the 1D electrostatic PIC model without orbit-averaging, and then generalize our conclusions to account for orbit averaging, multiplemore » dimensions, and electromagnetic models (Darwin). In all cases, a temporally, spatially, and particle-discrete local energy conservation theorem is shown to exist, proving that these formulations (as originally proposed in the literature), in addition to being locally charge conserving and globally energy conserving, are strictly locally energy conserving as well. In contrast to earlier proofs of local conservation in the literature, which only considered continuum time, our result is valid for the fully implicit time-discrete version of all models considered, including important features such as orbit averaging. We demonstrate the local-energy-conservation property numerically with a paradigmatic numerical example.« less